A Note on New Self - Dual [ 28 , 14 , 10 ] Codes over GF ( 7 )
نویسندگان
چکیده
The purpose of this note is to construct new self-dual codes over GF (7) of lengths 28 with the highest known minimum weights. We show the existence of at least 74 self-dual [28,14, 10] codes. Mathematics Subject Classification: 94B05
منابع مشابه
An Efficient Construction of Self-Dual Codes
We complete the building-up construction for self-dual codes by resolving the open cases over GF (q) with q ≡ 3 (mod 4), and over Zpm and Galois rings GR(p, r) with an odd prime p satisfying p ≡ 3 (mod 4) with r odd. We also extend the buildingup construction for self-dual codes to finite chain rings. Our building-up construction produces many new interesting self-dual codes. In particular, we ...
متن کاملDirected graph representation of half-rate additive codes over GF(4)
Abstract. We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2n) codes over GF(4) of length up to 7. From this we also derive classifications ...
متن کاملOptimal Linear Codes Over GF(7) and GF(11) with Dimension 3
Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...
متن کاملSome results on self-orthogonal and self-dual codes
We use generator matrices G satisfying GGT = aI+bJ over Zk to obtain linear self-orthogonal and self-dual codes. We give a new family of linear self-orthogonal codes over GF(3) and Z4 and a new family of linear selfdual codes over GF(3).
متن کاملSpectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with Respect to the {I, H, N}n Transform
We enumerate the inequivalent self-dual additive codes over GF(4) of blocklength n, thereby extending the sequence A090899 in The On-Line Encyclopedia of Integer Sequences from n = 9 to n = 12. These codes have a well-known interpretation as quantum codes. They can also be represented by graphs, where a simple graph operation generates the orbits of equivalent codes. We highlight the regularity...
متن کامل